Computable function - PDFSEARCH.IO - Document Search Engine

Computable function
Results: 170

#	Item
11	A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory Adam Yedidia Scott Aaronson Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2016-05-03 08:34:47 Mathematics Theoretical computer science Computability theory Mathematical logic Theory of computation Turing machine Models of computation Busy beaver Halting problem ZermeloFraenkel set theory Computability Computable function
12	Intro RAND & DNC WWKL & RWWKL Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2013-04-16 05:41:15 Mathematics Computability theory Theoretical computer science Theory of computation Reverse mathematics Computable function Graph coloring Randomness Rand RAND Corporation
13	DEGREES BOUNDING PRINCIPLES AND UNIVERSAL INSTANCES IN REVERSE MATHEMATICS LUDOVIC PATEY ABSTRACT. A Turing degree d bounds a principle P of reverse mathematics if every computable instance of P has a d-computable soluti Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2015-07-04 03:53:43 Mathematics Mathematical analysis Theory of computation Computability theory Theoretical computer science Computation in the limit Computable function Differential forms on a Riemann surface Congruence lattice problem
14	Fifth Internation Conference on Computability and Complexity in Analysis August 21-24, 2008, Hagen, Germany provisional programme Add to Reading List Source URL: cca-net.de Language: English - Date: 2008-08-19 05:08:00 Computability theory Computable function Computable analysis Recursively enumerable set Oracle machine Computability High Reduction Mathematical logic
15	(Prefix) Reversal Distance for (Signed) Strings with Few Blocks or Small AlphabetsI Laurent Bulteaua,1 , Guillaume Fertinb,2 , Christian Komusiewiczc,2,3 a Laboratoire d’Informatique Gaspard Monge, CNRS UMR 8049, Univ Add to Reading List Source URL: users.minet.uni-jena.de Language: English - Date: 2016-05-17 05:26:54 Formal languages Computability theory Theory of computation Character encoding String Computable function Permutation Pattern language
16	Math´ematiques `a rebours et un Lemme de K¨onig Faible de Type Ramsey Stage de Master 2 - MPRI mars - aoˆ ut 2012 Ludovic Patey ∗ Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2013-04-16 05:40:26 Mathematical logic Computability theory Mathematics Theoretical computer science Proof theory Logic in computer science Theory of computation Second-order arithmetic Combinatory logic Reverse mathematics Computable function
17	ON COMBINATORIAL WEAKNESSES OF RAMSEYAN PRINCIPLES LUDOVIC PATEY ABSTRACT. Avoidance properties such as cone avoidance or PA avoidance for a principle P in reverse mathematics shows the effectiveness weakness of P. Stron Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2015-10-09 14:07:43 Computability theory Theory of computation Computable number Computable function 01 class Computation in the limit
18	Fluctuations, effective learnability and metastability in analysis Ulrich Kohlenbach, Pavol Safarik Department of Mathematics, Technische Universit¨ at Darmstadt, Schlossgartenstraße 7, 64289 Darmstadt, Germany Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Language: English - Date: 2013-05-10 05:50:36 Computability theory Mathematical logic Mathematics Theoretical computer science Theory of computation Computable function Primitive recursive function operator Language identification in the limit Sequence Arithmetical hierarchy Cauchy sequence
19	A LIGHTFACE ANALYSIS OF THE DIFFERENTIABILITY RANK LINDA BROWN WESTRICK Abstract. We examine the computable part of the differentiability hierarchy defined by Kechris and Woodin. In that hierarchy, the rank of a differen Add to Reading List Source URL: www.math.uconn.edu Language: English - Date: 2014-10-24 11:30:43 Ordinal numbers Proof theory Computability theory Mathematical notation Ordinal notation Continuous function Constructible universe Limit of a function Symbol NC Computable number Fast-growing hierarchy
20	OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2015-10-26 09:24:01 Computability theory Mathematical logic Proof theory Theory of computation Logic in computer science Computable function Reverse mathematics PA degree Peano axioms